See Coxeter diagram in All languages combined, or Wiktionary
{ "forms": [ { "form": "Coxeter diagrams", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Coxeter diagram (plural Coxeter diagrams)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Algebra", "orig": "en:Algebra", "parents": [ "Mathematics", "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Geometry", "orig": "en:Geometry", "parents": [ "Mathematics", "Formal sciences", "Sciences", "All topics", "Fundamental" ], "source": "w" } ], "examples": [ { "ref": "1991, Gregori A. Margulis, Discrete Subgroups of Semisimple Lie Groups, page 358:", "text": "It suffices to make use of the tables above and observe that the Coxeter diagram of a direct sum of C-matrices is the disconnected union of the Coxeter diagrams of the summands.\nFor the description of C⁻-matrices satisfying condition (2) we shall use Coxeter diagrams with the additional stipulation that in case aᵢⱼ < −1 the vertices vᵢ and vⱼ are joined by a dotted line with index −aᵢⱼ. By the Coxeter diagram of a Coxeter polyhedron and a lattice generated by reflections we mean the Coxeter diagram of the corresponding C⁻-matrix.", "type": "quote" }, { "ref": "1993, B. Mühlherr, “Coxeter groups in Coxeter groups”, in Albrecht Beutelspacher, F. Buekenhout, J. Doyen, F. de Clerck, J. A. Thas, J. W. P. Hirschfeld, editors, Finite Geometries and Combinatorics, 2nd International Conference, page 277:", "text": "An automorphism of a Coxeter diagram M leads in a natural way to a Coxeter subgroup of the Coxeter group of type M. We introduce admissible partitions of Coxeter diagrams in order to generalize this situation.", "type": "quote" }, { "ref": "2008, Peter Abramenko, Kenneth S. Brown, Buildings: Theory and Applications, page 259:", "text": "The Coxeter diagrams of type E₇ and E₈ have no nontrivial automorphisms, so σ₀ is trivial in those cases.[…]The Coxeter diagram of type F₄ has a unique nontrivial automorphism, but σ₀ is trivial in this case. One can see this by using the Dynkin diagram instead of the Coxeter diagram and noting that it does not have any nontrivial automorphisms.", "type": "quote" } ], "glosses": [ "A Coxeter-Dynkin diagram." ], "id": "en-Coxeter_diagram-en-noun-U9kDRjOS", "links": [ [ "geometry", "geometry" ], [ "algebra", "algebra" ], [ "Coxeter-Dynkin diagram", "Coxeter-Dynkin diagram" ] ], "raw_glosses": [ "(geometry, algebra) A Coxeter-Dynkin diagram." ], "topics": [ "algebra", "geometry", "mathematics", "sciences" ] } ], "word": "Coxeter diagram" }
{ "forms": [ { "form": "Coxeter diagrams", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "Coxeter diagram (plural Coxeter diagrams)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English eponyms", "English lemmas", "English multiword terms", "English nouns", "English terms with quotations", "Pages with 1 entry", "Pages with entries", "Quotation templates to be cleaned", "en:Algebra", "en:Geometry" ], "examples": [ { "ref": "1991, Gregori A. Margulis, Discrete Subgroups of Semisimple Lie Groups, page 358:", "text": "It suffices to make use of the tables above and observe that the Coxeter diagram of a direct sum of C-matrices is the disconnected union of the Coxeter diagrams of the summands.\nFor the description of C⁻-matrices satisfying condition (2) we shall use Coxeter diagrams with the additional stipulation that in case aᵢⱼ < −1 the vertices vᵢ and vⱼ are joined by a dotted line with index −aᵢⱼ. By the Coxeter diagram of a Coxeter polyhedron and a lattice generated by reflections we mean the Coxeter diagram of the corresponding C⁻-matrix.", "type": "quote" }, { "ref": "1993, B. Mühlherr, “Coxeter groups in Coxeter groups”, in Albrecht Beutelspacher, F. Buekenhout, J. Doyen, F. de Clerck, J. A. Thas, J. W. P. Hirschfeld, editors, Finite Geometries and Combinatorics, 2nd International Conference, page 277:", "text": "An automorphism of a Coxeter diagram M leads in a natural way to a Coxeter subgroup of the Coxeter group of type M. We introduce admissible partitions of Coxeter diagrams in order to generalize this situation.", "type": "quote" }, { "ref": "2008, Peter Abramenko, Kenneth S. Brown, Buildings: Theory and Applications, page 259:", "text": "The Coxeter diagrams of type E₇ and E₈ have no nontrivial automorphisms, so σ₀ is trivial in those cases.[…]The Coxeter diagram of type F₄ has a unique nontrivial automorphism, but σ₀ is trivial in this case. One can see this by using the Dynkin diagram instead of the Coxeter diagram and noting that it does not have any nontrivial automorphisms.", "type": "quote" } ], "glosses": [ "A Coxeter-Dynkin diagram." ], "links": [ [ "geometry", "geometry" ], [ "algebra", "algebra" ], [ "Coxeter-Dynkin diagram", "Coxeter-Dynkin diagram" ] ], "raw_glosses": [ "(geometry, algebra) A Coxeter-Dynkin diagram." ], "topics": [ "algebra", "geometry", "mathematics", "sciences" ] } ], "word": "Coxeter diagram" }
Download raw JSONL data for Coxeter diagram meaning in English (2.5kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-18 from the enwiktionary dump dated 2025-01-01 using wiktextract (e4a2c88 and 4230888). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.